/**
 * @file luogu/4697/main.cpp
 * @brief
 * @see
 * @author Ruiming Guo (guoruiming@stu.scu.edu.cn)
 * @copyright 2022
 * @date 2022/6/23 13:30:37
 **/

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const int N = 200005;
int n, stk[N], top;
double r[N], x[N];
int main() {
  // High rating and good luck!
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%lf%lf", &x[i], &r[i]);
    while (top) {
      int j = stk[top];
      double limit = (x[i] - x[j]) * (x[i] - x[j]) / (4.0 * r[j]);
      if (r[i] > limit) r[i] = limit;
      if (r[i] <= r[j])
        break;
      else
        --top;
    }
    stk[++top] = i;
    printf("%.6lf\n", r[i]);
  }
  return 0;
}
